Dynamic and distributed early planning assessment by a hybrid simulated annealing and greedy algorithmMAROPOULOS, P. G; MCKAY, K; BRAMALL, D. G et al.Proceedings of the Institution of Mechanical Engineers. Part B. Journal of engineering manufacture. 2003, Vol 217, Num 10, pp 1429-1442, issn 0954-4054, 14 p.Article

The average behaviour of greedy algorithms for the knapsack problem: General distributionsDIUBIN, Gennady; KORBUT, Alexander.Mathematical methods of operations research (Heidelberg). 2003, Vol 57, Num 3, pp 449-479, issn 1432-2994, 31 p.Article

GRASP with a new local Search scheme for Vehicle Routing problems with Time WindowsCHAOVALITWONGSE, Wanpracha; DUKWON KIM; PARDALOS, Panos M et al.Journal of combinatorial optimization. 2003, Vol 7, Num 2, pp 179-207, issn 1382-6905, 29 p.Article

Minimum-cost dynamic flows: The series-parallel caseKLINZ, Bettina; WOEGINGER, Gerhard J.Networks (New York, NY). 2004, Vol 43, Num 3, pp 153-162, issn 0028-3045, 10 p.Article

On the geometric structure of independence systemsCONFORTI, M; LAURENT, M.Mathematical programming. 1989, Vol 45, Num 2, pp 255-277, issn 0025-5610, 23 p.Article

The sequential sum problem and performance bounds on the greedy algorithm for the on-line steiner problemMILLER, Zevi; PRITIKIN, Dan; PERKEL, Manley et al.Networks (New York, NY). 2005, Vol 45, Num 3, pp 143-164, issn 0028-3045, 22 p.Article

Learning Capability of Relaxed Greedy AlgorithmsSHAOBO LIN; YUANHUA RONG; XINGPING SUN et al.IEEE transactions on neural networks and learning systems (Print). 2013, Vol 24, Num 10, pp 1598-1608, issn 2162-237X, 11 p.Article

A Novel Resource Allocation and Admission Control in LTE SystemsROY, Abhishek; SAXENA, Navrati; SHIN, Jitae et al.IEICE transactions on communications. 2010, Vol 93, Num 3, pp 721-724, issn 0916-8516, 4 p.Article

On the performance of greedy algorithms in packet bufferingALBERS, Susanne; SCHMIDT, Markus.SIAM journal on computing (Print). 2006, Vol 35, Num 2, pp 278-304, issn 0097-5397, 27 p.Article

An improved resource allocation scheme for plane cover multiple access using genetic algorithmWU, Xiang; SHARIF, Bayan S; HINTON, Oliver R et al.IEEE transactions on evolutionary computation. 2005, Vol 9, Num 1, pp 74-81, issn 1089-778X, 8 p.Article

Characterizations of polygreedoids and poly-antimatroids by greedy algorithmsNAKAMURA, Masataka.Operations research letters. 2005, Vol 33, Num 4, pp 389-394, issn 0167-6377, 6 p.Article

A better-than-greedy approximation algorithm for the minimum set cover problemHASSIN, Refael; LEVIN, Asaf.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 189-200, issn 0097-5397, 12 p.Article

The Weak Chebyshev X-Greedy Algorithm in the unweighted Bergman spaceDILWORTH, S. J; KUTZAROVA, Denka; SHUMAN, Karen L et al.Journal of mathematical analysis and applications. 2006, Vol 318, Num 2, pp 692-706, issn 0022-247X, 15 p.Article

The thresholding greedy algorithm, greedy bases, and dualityDILWORTH, S. J; KALTON, N. J; KUTZAROVA, Denka et al.Constructive approximation. 2003, Vol 19, Num 4, pp 575-597, issn 0176-4276, 23 p.Article

A study on the tool sharing policy in FMS with tool center : Advanced production schedulingZHANG, Xiaoming; FUJII, Susumu; KAIHARA, Toshiya et al.JSME international journal. Series C, Mechanical systems, machine elements and manufacturing. 2003, Vol 46, Num 1, pp 24-32, issn 1344-7653, 9 p.Article

An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problemGLOVER, F; KLINGMAN, D; KRISHNAN, R et al.European journal of operational research. 1992, Vol 56, Num 3, pp 343-356, issn 0377-2217Article

On the definition of a prosodically balanced corpus: combining greedy algorithms with expert guided manipulationESCUDERO-MANCEBO, David; AGUILAR, Lourdes; BONAFONTE, Antonio et al.Procesamiento del lenguaje natural. 2009, Num 43, pp 93-101, issn 1135-5948, 9 p.Article

The Regenerator Location ProblemSI CHEN; LJUBIE, Ivana; RAGHAVAN, S et al.Networks (New York, NY). 2010, Vol 55, Num 3, pp 205-220, issn 0028-3045, 16 p.Conference Paper

One-dimensional heuristics adapted for two-dimensional rectangular strip packingBELOV, G; SCHEITHAUER, G; MUKHACHEVA, E. A et al.The Journal of the Operational Research Society. 2008, Vol 59, Num 6, pp 823-832, issn 0160-5682, 10 p.Article

Algorithms and trade-offs in multicast service overlay designLI LAO; CUI, Jun-Hong; GERLA, Mario et al.Simulation (San Diego, Calif.). 2006, Vol 82, Num 6, pp 369-381, issn 0037-5497, 13 p.Conference Paper

On structures of bisubmodular polyhedraANDO, K; FUJISHIGE, S.Mathematical programming. 1996, Vol 74, Num 3, pp 293-317, issn 0025-5610Article

Long-term staff scheduling with regular temporal distributionCARRASCO, Rafael C.Computer methods and programs in biomedicine (Print). 2010, Vol 100, Num 2, pp 191-199, issn 0169-2607, 9 p.Article

A note on 'Algorithms for connected set cover problem and fault-tolerant connected set cover problemWEI REN; QING ZHAO.Theoretical computer science. 2011, Vol 412, Num 45, pp 6451-6454, issn 0304-3975, 4 p.Article

Improved stability conditions of BOGA for noisy block-sparse signalsLU WANG; GUOAN BI; CHUNRU WAN et al.Signal processing. 2011, Vol 91, Num 11, pp 2567-2574, issn 0165-1684, 8 p.Article

On the growth of the counting function of Stanley sequencesMOY, Richard A.Discrete mathematics. 2011, Vol 311, Num 7, pp 560-562, issn 0012-365X, 3 p.Article